The Nilpotence Height of P

نویسنده

  • KENNETH G. MONKS
چکیده

The method of Walker and Wood is used to completely determine the nilpotence height of the elements P s t in the Steenrod algebra at the prime 2. In particular, it is shown that (P s t ) 2bs/tc+2 = 0 for all s ≥ 0, t ≥ 1. In addition, several interesting relations in A are developed in order to carry out the proof.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Brauer pairs of Camina p - groups of nilpotence class 2

In this paper, we find a condition that characterizes when two Camina p-groups of nilpotence class 2 form a Brauer pair. MSC primary: 20C15

متن کامل

Equivalent Conditions for P -nilpotence

In the first part of this paper we prove without using the transfer or characters the equivalence of some conditions, each of which would imply p-nilpotence of a finite group G. The implication of p-nilpotence also can be deduced without the transfer or characters if the group is p-constrained. For p-constrained groups we also prove an equivalent condition so that O ′ (G)P should be p-nilpotent...

متن کامل

The Bousfield Lattice for Truncated Polynomial Algebras

The global structure of the unbounded derived category of a truncated polynomial ring on countably many generators is investigated, via its Bousfield lattice. The Bousfield lattice is shown to have cardinality larger than that of the real numbers, and objects with large tensor-nilpotence height are constructed.

متن کامل

Nilpotence in the Steenrod Algebra

While all of the relations in the Steenrod algebra, A, can be deduced in principle from the Adem relations, in practice, it is extremely difficult to determine whether a given polynomial of elements in A is zero for all but the most elementary cases. In his original paper [Mi] Milnor states “It would be interesting to discover a complete set of relations between the given generators of A”. In p...

متن کامل

Construction Methods for Sign Patterns Allowing Nilpotence of Index k

In this paper, the smallest such integer k is called by the index (of nilpotence) of B such that B = 0. In this paper, we study sign patterns allowing nilpotence of index k and obtain four methods to construct sign patterns allowing nilpotence of index at most k, which generalizes some recent results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997